翻訳と辞書
Words near each other
・ Database normalization
・ Database of Interacting Proteins
・ Database of Molecular Motions
・ Database of protein conformational diversity
・ Database of Recorded American Music
・ Database of Salon Artists
・ Database preservation
・ Database publishing
・ Database refactoring
・ Database schema
・ Database search engine
・ Database security
・ Database seeding
・ Database server
・ Database state
Database storage structures
・ Database System Concepts
・ Database testing
・ Database theory
・ Database transaction
・ Database trigger
・ Database tuning
・ Database virtualization
・ Database Workbench
・ Database-as-IPC
・ Database-centric architecture
・ DatabaseObjects
・ DatabaseSpy
・ Databending
・ DataBlade


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Database storage structures : ウィキペディア英語版
Database storage structures

Database tables and indexes may be stored on disk in one of a number of forms, including ordered/unordered flat files, ISAM, heap files, hash buckets, or B+ trees. Each form has its own particular advantages and disadvantages. The most commonly used forms are B+ trees and ISAM. Such forms or structures are one aspect of the overall schema used by a database engine to store information.
==Unordered==

Unordered storage typically stores the records in the order they are inserted. Such storage offers good insertion efficiency (O\left(1\right)), but inefficient retrieval times (O\left(n\right)). Typically these retrieval times are better, however, as most databases use indexes on the primary keys, resulting in retrieval times of O\left(\log n\right) or O\left(1\right) for keys that are the same as the database row offsets within the storage system.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Database storage structures」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.